Distinguishing Experiments for Timed Nondeterministic Finite State Machines

Distinguing Non-deterministic Timed Finite State Machines

Conformance testing with the guaranteed fault coverage is based on distinguishing faulty system implementations from the corresponding system specification. We consider timed systems modeled by timed possibly nondeterministic finite state machines (TFSMs) and propose algorithms for distinguishing two TFSMs. In particular, we present a preset algorithm for separating two separable TFSMs and an a...

Deriving Test Suites for Timed Finite State Machines

This paper is devoted to the derivation of distinguishing sequences for timed Finite State Machines (FSM). Such distinguishing sequences are used when deriving a test suite for a timed FSM with the guaranteed fault coverage.

Back to the Future: Towards a Theory of Timed Regular Languages

Timed automata are nite-state machines constrained by timing requirements so that they accept timed words | words in which every symbol is labeled with a real-valued time. These automata were designed to lead to a theory of nite-state real-time properties with applications to the automatic veri cation of real-time systems. However, both deterministic and nondeterministic versions su er from dra...

Preset and Adaptive Homing Experiments for Nondeterministic Finite State Machines

Test Selection Based on Communicating Nondeterministic Finite-State Machines Using a Generalized WP-Method

We present a method of generating test sequences for concurrent programs and communication protocols that are modeled as communicating nondeterministic finite state machines (CNFSMs). A conformance relation, called trace-equivalence, is defined within this model, serving as a guide to test generation. A test generation method for a single nondeterministic finite state machine (NFSM) is develope...